Robust, expressive, and quantitative linear temporal logics: Pick any two for free

Expressive Power of Temporal Logics

The objectives of this paper is to survey classical and recent expressive completeness results and to provide some external yardsticks by which the expressive power of temporal logics can be measured.

Some Expressive Temporal Logics of Minkowski Spacetimes

Parity Automata for Quantitative Linear Time Logics

We initiate a study of automata-based model checking for previously proposed quantitative linear time logics interpreted over coalgebras. Our results include: (i) an automata-theoretic characterisation of the semantics of these logics, based on a notion of extent of a quantitative parity automaton, (ii) a study of the expressive power of Büchi variants of such automata, with implications on the...

Temporal Conjunctive Queries in Expressive Description Logics with Transitive Roles

In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. In order to deal with dynamically changing data sources, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of OBDA to support the processing...

Two-sorted Metric Temporal Logics

Temporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems. Standard temporal logic is inadequate for real-time applications because it only deals with qualitative timing properties. This is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expre...